On the Distribution of the of Frobenius Elements on Elliptic Curves over Function Fields
نویسنده
چکیده
Let C be a smooth projective irreducible curve defined over a finite field Fq of q elements and characteristic p > 3 with function field K = Fq(C). Let E/K be a non-constant elliptic curve and φ : E → C its minimal regular model. For every P ∈ C, denote by deg(P ) = [κP : Fq] its degree and qP = q deg(P . If EP = φ (P ) is an elliptic curve over κP denote by t(EP ) = qP + 1 − #EP (κP ) the trace of Frobenius of E at P . It follows from a theorem of Hasse-Weil [11, Chapter V, Theorem 2.4] t(EP ) = q 1/2 P (e iθ(EP ) + eP ) = 2q 1/2 P cos(θ(EP )) with 0 ≤ θ(EP ) ≤ π and t(EP ) ≤ 2q 1/2 P . Denote by C0 the set of points P ∈ C such that EP is an elliptic curve. In [9] we addressed the following question. Question 1.1. Let B ≥ 1 and t be integers with |t| ≤ 2q. Let π(B, t) = #{P ∈ C0 | deg(P ) ≤ B and t(EP ) = t}. How big is π(B, t)?
منابع مشابه
Complete characterization of the Mordell-Weil group of some families of elliptic curves
The Mordell-Weil theorem states that the group of rational points on an elliptic curve over the rational numbers is a finitely generated abelian group. In our previous paper, H. Daghigh, and S. Didari, On the elliptic curves of the form $ y^2=x^3-3px$, Bull. Iranian Math. Soc. 40 (2014), no. 5, 1119--1133., using Selmer groups, we have shown that for a prime $p...
متن کاملGeneralized Jacobian and Discrete Logarithm Problem on Elliptic Curves
Let E be an elliptic curve over the finite field F_{q}, P a point in E(F_{q}) of order n, and Q a point in the group generated by P. The discrete logarithm problem on E is to find the number k such that Q = kP. In this paper we reduce the discrete logarithm problem on E[n] to the discrete logarithm on the group F*_{q} , the multiplicative group of nonzero elements of Fq, in the case where n | q...
متن کاملOn the rank of certain parametrized elliptic curves
In this paper the family of elliptic curves over Q given by the equation Ep :Y2 = (X - p)3 + X3 + (X + p)3 where p is a prime number, is studied. Itis shown that the maximal rank of the elliptic curves is at most 3 and someconditions under which we have rank(Ep(Q)) = 0 or rank(Ep(Q)) = 1 orrank(Ep(Q))≥2 are given.
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملOn the elliptic curves of the form $ y^2=x^3-3px $
By the Mordell-Weil theorem, the group of rational points on an elliptic curve over a number field is a finitely generated abelian group. There is no known algorithm for finding the rank of this group. This paper computes the rank of the family $ E_p:y^2=x^3-3px $ of elliptic curves, where p is a prime.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002